Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This belongs to the domain and packing (C&P) problems. study approached category C&P problems called minimum time cut path (MTCP) problem, which aims identify sequence sliding movements for head device minimize time. Both slide speeds (just moving head) vary according equipment, despite their relevance real-world scenarios. applied MTCP on practical scope presents two metaheuristics tackling more significant instances that resemble requirements. experiments presented this utilized parameter values typical laser machines assess feasibility proposed methods compared existing commercial software. results show metaheuristic-based solutions are competitive when addressing problems, achieving increased performance regarding processing 94% instances.